Combinatorial Chessboard Rearrangements
نویسنده
چکیده
Many problems concerning tilings of rectangular boards are of significant combinatorial interest. In this paper we introduce a similar type of counting problem based on game piece rearrangements. Many of these rearrangements satisfy recurrence relations which can be computed using various combinatorial techniques. We also present the solution to a rearrangement counterpart to the well–known knight’s tour problem.
منابع مشابه
Perfect Matchings and Perfect Squares
In 1961, P.W. Kasteleyn enumerated the domino tilings of a 2n × 2n chessboard. His answer was always a square or double a square (we call such a number "squarish"), but he did not provide a combinatorial explanation for this. In the present thesis, we prove by mostly combinatorial arguments that the number of matchings of a large class of graphs with 4-fold rotational symmetry is squarish; our ...
متن کاملRandom disease on the square grid
We introduce some generalizations of a nice combinatorial problem, the central notion of which is the so-called Disease Process. Let us color independently each square of an n×n chessboard black with a probability p(n), this is a random initial configuration of our process. Then we have a deterministic painting or expansion rule, and the question is the behaviour of the disease process determin...
متن کاملTowards a Computational Theory of Genome Rearrangements
Analysis of genome rearrangements in molecular biology started in the late 1930's, when Dobzhansky and Sturtevant published a milestone paper presenting a rearrangement scenario with 17 inversions for the species of Drosophila. However, until recently there were no computer science results allowing a biologist to analyze genome rearrangements. The paper describes combinatorial problems motivate...
متن کاملThe Rook on the Half-Chessboard, or How Not to Diagonalize a Matrix
1/i if i + j ≥ n + 1 0 otherwise, has eigenvalues 1,−1/2, 1/3, . . . , (−1)/n. In Section 2, we establish this result in two ways: (1) by explicitly exhibiting eigenvectors via an odd-looking combinatorial identity, and (2) by giving a matrix that conjugates Tn into an upper triangular matrix. In Section 3, we use the knowledge of the eigenvalues of Tn to study two related random walks, most co...
متن کاملRestricted Tilings and Bijections
A classic problem in elementary combinatorics asks in how many ways one can tile a 1×n chessboard using 1× 1 and 1× 2 squares. The number of such tilings is the nth Fibonacci number. In a 2010 paper, Grimaldi generalized this problem by allowing for 1× 1 tiles to have one of w types and 1× 2 tiles to have one of t types and found that the solutions, in w and t, satisfied many of the same proper...
متن کامل